Bernstein based arithmetic featuring de Casteljau
نویسندگان
چکیده
Bernstein based interval analysis permits to trace algebraic curves and surfaces. In this paper, we propose to use the classical de Casteljau algorithm to improve the efficiency of the Bernstein based method. The proposed tracing method gives significant results with functions of high degree. These results are illustrated and compared with other interval analysis approaches.
منابع مشابه
A de Casteljau Algorithm for Bernstein type Polynomials based on (p, q)-integers in CAGD
In this paper, a de Casteljau algorithm to compute (p, q)-Bernstein Bézier curves based on (p, q)integers is introduced. We study the nature of degree elevation and degree reduction for (p, q)-Bézier Bernstein functions. The new curves have some properties similar to q-Bézier curves. Moreover, we construct the corresponding tensor product surfaces over the rectangular domain (u, v) ∈ [0, 1]× [0...
متن کاملA formal study of Bernstein coefficients and polynomials
Bernstein coe cients provide a discrete approximation of the behavior of a polynomial inside an interval. This can be used for example to isolate real roots of polynomials. We prove a criterion for the existence of a single root in an interval and the correctness of the de Casteljau algorithm to compute e ciently Bernstein coe cients. Key-words: Polynomials, de Casteljau, Bernstein polynomials,...
متن کاملMatrix methods for the simplicial Bernstein representation and for the evaluation of multivariate polynomials
In this paper, multivariate polynomials in the Bernstein basis over a simplex (simplicial Bernstein representation) are considered. Two matrix methods for the computation of the polynomial coefficients with respect to the Bernstein basis, the so-called Bernstein coefficients, are presented. Also matrix methods for the calculation of the Bernstein coefficients over subsimplices generated by subd...
متن کاملA comparison between two evaluation algorithms for polynomial curves
In this paper we compare the de Casteljau algorithm with a more efficient algorithm associated to another shape preserving representation. We prove that the Bernstein basis is better conditioned than the basis associated to the more efficient algorithm. Error analysis results are presented. Numerical experiments are also included.
متن کاملBezier curves and surfaces based on modified Bernstein polynomials
. Parametric curves are represented using these modified Bernstein basis and the concept of total positivity is applied to investigate the shape properties of the curve. We get Bézier curve defined on [0, 1] when we set the parameter α, β to the value 0. We also present a de Casteljau algorithm to compute Bernstein Bézier curves and surfaces with shifted knots. The new curves have some properti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005